Renesting Single Appearance Schedules to Minimize Buffer Memory
نویسندگان
چکیده
A portion of this research was undertaken as part of the Ptolemy project, which is supported by the Advanced Research Projects Agency and the U. S. Air Force (under the RASSP program, contract F33615-93-C-1317), Semiconductor Research Corporation (project 94-DC-008), National Science Foundation (MIP-9201605), Office of Naval Technology (via Naval Research Laboratories), the State of California MICRO program, and the following companies: Bell Northern Research, Dolby, Hitachi, Mentor Graphics, Mitsubishi, NEC, Pacific Bell, Philips, Rockwell, Sony, and Synopsys.
منابع مشابه
Memory Efficient Software Synthesis from Dataflow Graph
Due to the limited amount of memory resources in embedded systems, minimizing the memory requirements is an important goal of software synthesis. This paper presents a set of techniques to reduce the code and data size for software synthesis from graphical DSP programs based on the synchronous dataflow (SDF) model. By sharing the kernel code among multiple instances of a block, we can further r...
متن کاملBuffer Memory Optimization in DSP Applications - An Evolutionary Approach
In the context of digital signal processing, synchronous data ow (SDF) graphs 12] are widely used for speciication. For these, so called single appearance schedules provide program memory-optimal uni-processor implementations. Here, buuer memory minimized schedules are explored among these using an Evolutionary Algorithm (EA). Whereas for a restricted class of graphs, there exist optimal polyno...
متن کاملShared buffer implementations of signal processing systems usinglifetime analysis techniques
There has been a proliferation of block-diagram environments for specifying and prototyping digital signal processing (DSP) systems. These include tools from academia such as Ptolemy and commercial tools such as DSPCanvas from Angeles Design Systems, signal processing work system (SPW) from Cadence, and COSSAP from Synopsys. The block diagram languages used in these environments are usually bas...
متن کاملOptimized Software Synthesis for DigitalSignal Processing
This paper addresses the problem of trading-o between the minimization of program and data memory requirements of single-processor implementations of data ow programs. Based on the formal model of synchronous data ow (SDF) graphs [LM87], so called single appearance schedules are known to be program-memory optimal. Among these schedules, bu er memory schedules are investigated and explored based...
متن کاملEvolutionary Algorithms for the Synthesis ofEmbedded
| This paper addresses the problem of trading-oo between the minimization of program and data memory requirements of single-processor implementations of dataaow programs. Based on the formal model of synchronous data ow (SDF) graphs 1], so called single appearance schedules are known to be program-memory optimal. Among these schedules, buuer memory schedules are investigated and explored based ...
متن کامل